Forcing under Anti-Foundation Axiom: An expression of the stalks
نویسنده
چکیده
We introduce a new simple way of defining the forcing method that works well in the usual setting under FA, the Foundation Axiom, and moreover works even under Aczel’s AFA, the Anti-Foundation Axiom. This new way allows us to have an intuition about what happens in defining the forcing relation. The main tool is H. Friedman’s method of defining the extensional membership relation ∈ by means of the intensional membership relation ε. Analogously to the usual forcing and the usual generic extension for FA-models, we can justify the existence of generic filters and can obtain the Forcing Theorem and the Minimal Model Theorem with some modifications. These results are on the line of works to investigate whether model theory for AFA-set theory can be developed in a similar way to that for FA-set theory. Aczel pointed out that the quotient of transition systems by the largest bisimulation and transition relations have the essentially same theory as the set theory with AFA. Therefore, we could hope that, by using our new method, some open problems about transition systems turn out to be consistent or independent.
منابع مشابه
The Bounded Proper Forcing Axiom
The bounded proper forcing axiom BPFA is the statement that for any family of א1 many maximal antichains of a proper forcing notion, each of size א1, there is a directed set meeting all these antichains. A regular cardinal κ is called Σ1-reflecting, if for any regular cardinal χ, for all formulas φ, “H(χ) |= ‘φ’ ” implies “∃δ<κ, H(δ) |= ‘φ’ ” We show that BPFA is equivalent to the statement tha...
متن کاملA Class of Consistent Anti-martin’s Axioms
Both the Continuum Hypothesis and Martin's Axiom allow induc-tive constructions to continue in circumstances where the inductive hypothesis might otherwise fail. The search for useful related axioms procedes naturally in two directions: towards "Super Martin's Axioms ," which extend MA to broader classes of orders; and towards "Anti-Martin's Axioms" (AMA's) which are strictly weaker than CH, bu...
متن کاملOn Generic Stalks of Sheaves
Sheaf theoretic notions and methods have entered model theory during recent years and important constructions like reduced powers and products, unions of chains, Boolean valued models and models for non-classical logics appear here in a unified setting. If one looks at a sheaf as a generalized structure, then forcing becomes the genuine extension of the validity relation between models and form...
متن کاملAnti-forcing number of some specific graphs
Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...
متن کاملGlobal Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Log. Q.
دوره 52 شماره
صفحات -
تاریخ انتشار 2006